Aiming at the management requirement of real-time personnel statistics in office scenes with relatively fixed personnel positions, a laboratory personnel statistics and management system based on Faster Region-based Convolutional Neural Network (Faster R-CNN) and Intersection over Union (IoU) optimization was designed and implemented with an ordinary university laboratory as the example. Firstly, Faster R-CNN model was used to detect the heads of the people in the laboratory. Then, according to the output results of the model detection, the repeatedly detected targets were filtered by using IoU algorithm. Finally, a coordinate-based method was used to determine whether there were people at each workbench in the laboratory and store the corresponding data in the database. The main functions of the system are as follows:① real-time video surveillance and remote management of the laboratory; ② timed automatic photo, detection and acquisition of data to provide data support for the quantitative management of the laboratory; ③ laboratory personnel change data query and visualization. The experimental results show that the proposed laboratory personnel statistics and management system based on Faster R-CNN and IoU optimization can be used for real-time personnel statistics and remote management in office scenes.

In view of the deficiency of the existing weighted association rules mining algorithms which are not applied to deal with matrix-weighted data, a new pruning strategy of itemsets was given and the evaluation framework of matrix-weighted association patterns, SRCCCI (Support-Relevancy-Correlation Coefficient-Confidence-Interest), was introduced in this paper firstly, and then a novel mining algorithm, MWARM-SRCCCI (Matrix-Weighted Association Rules Mining based on SRCCCI), was proposed, which was used for mining matrix-weighted positive and negative patterns in databases. Using the new pruning technique and the evaluation standard of patterns, the algorithm could overcome the defects of the existing mining techniques, mine valid matrix-weighted positive and negative association rules, avoid the generation of ineffective and uninteresting patterns. Based on Chinese Web test dataset CWT200g (Chinese Web Test collection with 200GB web Pages) for the experimental data, MWARM-SRCCCI could make the biggest decline of its mining time by up to 74.74% compared with the existing no-weighted positive and negative association rules mining algorithms. The theoretical analysis and experimental results show that, the proposed algorithm has better pruning effect, which can reduce the number of candidate itemsets and mining time and improve mining efficiency markedly, and the association patterns of this algorithm can provide reliable query expansion terms for information retrieval.

Nowadays, many centificateless signature schemes depend on the honesty of Key Generation Center (KGC) excessively, so they also lose security guarantees when the KGC is dishonest. By analyzing the security of the certificateless signature scheme proposed by Liang Hongmei et. al. in security analysis and improvement of efficient certificateless signature scheme publicated by Journal fo Computer Applications, 2010,30(3):685-687, where the authors pointed out that the scheme could not resist public key replacement attack under negative dishonest KGC and positive dishonest KGCs attacks. Aiming at these problems, the scheme was improved by the means that KGC generated the users public key and made it public. The analysis of security shows that the improved scheme is able to resist public key replacement attack under negative dishonest KGC, thus successfully distinguishing the positive dishonesty of KGC,and resisting existential forgery on adaptively chosen message attack under the random oracle model.